Hierarchical Density-based Clustering of Shapes
نویسندگان
چکیده
This article describes a novel way of representing large databases of shapes. We propose a hierarchical clustering of a set of Fourier-transformed contours. The clustering analysis is density-based and is performed using topographic maps. We have tested the approach on a database of extracted contours of marine animals, generated by Mokhtarian and co-workers. The resulting clusters group contours that show similar global shapes, which sometimes diier from those grouped by Mokhtarian and co-workers, due to a diierence in similarity criterion.
منابع مشابه
Assessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملLocal Density-based Hierarchical Clustering for Overlapping Distribution using Minimum Spanning Tree
In this paper, we propose a clustering algorithm to find clusters of different sizes, shapes and densities. Density and Hierarchical based approaches are adopted in the algorithm using Minimum Spanning Tree, resulting in a new algorithm – Local Density-based Hierarchical Clustering Algorithm for overlapping data distribution using Minimum Spanning Tree (LDHCODMST). The algorithm is divided into...
متن کاملLocal Density-based Hierarchical Clustering for Overlapping Distribution using Minimum Spanning Tree
In this paper, we propose a clustering algorithm to find clusters of different sizes, shapes and densities. Density and Hierarchical based approaches are adopted in the algorithm using Minimum Spanning Tree, resulting in a new algorithm – Local Density-based Hierarchical Clustering Algorithm for overlapping data distribution using Minimum Spanning Tree (LDHCODMST). The algorithm is divided into...
متن کاملHigh-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملA Hierarchical Approach for Clusters in Different Densities
Clustering has the following challenges: 1) clusters with arbitrary shapes; 2) minimal domain knowledge to determine the input parameters; 3) scalability for large data sets. Density-based clustering has been recognized as a powerful approach for discovering clusters with arbitrary shapes. However, the other two challenges still remain in most existing clustering algorithms. In this paper, we e...
متن کامل